Solving the Network Shortest Path Problem on a Quantum Annealer
نویسندگان
چکیده
منابع مشابه
On Solving the Quadratic Shortest Path Problem
The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order m + 1, where m is the number of arcs in the graph. We use the alternating direction method of...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملShortest Path Problem on Intuitionistic Fuzzy Network
Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...
متن کاملA DNA procedure for solving the shortest path problem
In this paper, we consider a procedure for solving the shortest path problem in the Adleman–Lipton model. The procedure works in O(n) steps for the shortest path problem of an edge-weighted graph with n vertices. 2006 Elsevier Inc. All rights reserved.
متن کاملShortest Path Problem on a Network with Imprecise Edge Weight
Nayeem and Pal (Shortest path problem on a network with imprecise edge weight, Fuzzy Optimization and Decision Making 4, 293-312, 2005) proposed a new algorithm for solving shortest path problem on a network with imprecise edge weight. In this paper the shortcomings of the existing algorithm, (Nayeem and Pal, 2005) are pointed out and to overcome these shortcomings a new algorithm is proposed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Quantum Engineering
سال: 2020
ISSN: 2689-1808
DOI: 10.1109/tqe.2020.3021921